#include "BST.h"

int main()
{
	BST<int> t;
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	for (auto e : a)
	{
		t.Insert(e);
	}
	//t.InOrder();
	t.Insert(16);
	//t.InOrder();
	/*int num = 0;
	cin >> num;
	if (t.Find(num))
	{
		cout << "Y" << endl;
	}
	else {
		cout << "N" << endl;
	}*/

	for (auto e : a)
	{
		t.Erase(e);
		t.InOrder();
	}
	return 0;
}